Matrix Mortality and the Cerný-Pin Conjecture
نویسندگان
چکیده
In this paper, we establish the Černý-Pin conjecture for automata with the property that their transition monoid cannot recognize the language {a, b}∗ab{a, b}∗. For the subclass of automata whose transition monoids have the property that each regular J -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.
منابع مشابه
The Averaging Trick and the Cerný Conjecture
The results of several papers concerning the Černý conjecture are deduced as consequences of a simple idea that I call the averaging trick. This idea is implicitly used in the literature, but no attempt was made to formalize the proof scheme axiomatically. Instead, authors axiomatized classes of automata to which it applies.
متن کاملAn Efficient and Cost Effective Protocol for In Vitro Propagation of Pineapple
An efficient and cost effective protocol for in vitro propagation of Pineapple (Ananas comosus var. Queen) has been developed. In the proliferation stage, agar based Murashige and Skoog (MS) media was supplemented with 3.0 mg/l benzyleaminopurine (BAP), 0.5 mg/l indole acetic acid (IAA) and 50 mg/l adenine sulphate as RBC design experiment. Two approaches were taken to reduce the chemical cost ...
متن کامل2-quasirecognizability of the simple groups B_n(p) and C_n(p) by prime graph
Let G be a finite group and let $GK(G)$ be the prime graph of G. We assume that $n$ is an odd number. In this paper, we show that if $GK(G)=GK(B_n(p))$, where $ngeq 9$ and $pin {3,5,7}$, then G has a unique nonabelian composition factor isomorphic to $B_n(p)$ or $C_n(p)$ . As consequences of our result, $B_n(p)$ is quasirecognizable by its spectrum and also by a new proof, the ...
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملLes automates circulaires biaisés vérifient la conjecture de Cerný
An action X x A^ —> X : (x.w) *—• x * w ofthefree semigroup A^~ over the alphabet A is synchronised by a word w G A + if x * w = y * w for ail x}y £ X. Cerny conjecturée that if there is such a w and \X\ = n, then there is one oflength < (n l ) 2 . The conjecture remains open, except for particular classes of actions. An action is circular if there is c G A acting as a circular permutation, and...
متن کامل